Optimal Bounds for the Predecessor Problem and Related Problems
نویسندگان
چکیده
We obtain matching upper and lower bounds for the amount of time to find the predecessor of a given element among the elements of a fixed compactly stored set. Our algorithms are for the unit-cost word RAM with multiplication and are extended to give dynamic algorithms. The lower bounds are proved for a large class of problems, including both static and dynamic predecessor problems, in a much stronger communication game model, but they apply to the cell probe and RAM models.
منابع مشابه
Determining the Optimal Value Bounds of the Objective Function in Interval Quadratic Programming Problem with Unrestricted Variables in Sign
In the most real-world applications, the parameters of the problem are not well understood. This is caused the problem data to be uncertain and indicated with intervals. Interval mathematical models include interval linear programming and interval nonlinear programming problems.A model of interval nonlinear programming problems for decision making based on uncertainty is interval quadratic prog...
متن کاملOptimal Solution in a Constrained Distribution System
We develop a method to obtain an optimal solution for a constrained distribution system with several items and multi-retailers. The objective is to determine the procurement frequency as well as the joint shipment interval for each retailer in order to minimize the total costs. The proposed method is applicable to both nested and non-nested policies and ends up with an optimal solution. To solv...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کاملمساله پوشش هاب تک تخصیصی بر روی شبکه ستارهای؛ مدلبندی، خطیسازی و یافتن کران مناسب برای آن
The present study evaluates two problems of single allocation hub-covering problem with star structure including two problems of maximal p-hub covering and hub covering by considering the flow transfer costs. The star structure is as there is a central hub with definite location and other hubs are connected directly to the central hub. In the first problem, the goal is selection of p-hub locati...
متن کاملMarked Ancestor Problems ( Preliminary Version )
Consider a rooted tree whose nodes can be marked or unmarked. Given a node, we want to find its nearest marked ancestor. This generalises the well-known predecessor problem, where the tree is a path. We show tight upper and lower bounds for this problem. The lower bounds are proved in the cell probe model, the upper bounds run on a unit-cost RAM. As easy corollaries we prove (often optimal) low...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comput. Syst. Sci.
دوره 65 شماره
صفحات -
تاریخ انتشار 2002